Eigenvalues and Colorings of Digraphs
نویسنده
چکیده
Wilf’s eigenvalue upper bound on the chromatic number is extended to the setting of digraphs. The proof uses a generalization of Brooks’ Theorem to digraph colorings.
منابع مشابه
On the Number of Synchronizing Colorings of Digraphs
We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of such a digraph can be colored by elements of some fixed k-element set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road coloring theorem states that every primitive digraph has a synchronizing coloring. In the pr...
متن کاملGallai's Theorem for List Coloring of Digraphs
A classical theorem of Gallai states that in every graph that is critical for k-colorings, the vertices of degree k − 1 induce a tree-like graph whose blocks are either complete graphs or cycles of odd length. We provide a generalization to colorings and list colorings of digraphs, where some new phenomena arise. In particular, the problem of list coloring digraphs with the lists at each vertex...
متن کاملOn Synchronizing Colorings and the Eigenvectors of Digraphs
An automaton is synchronizing if there exists a word that sends all states of the automaton to a single state. A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. The famous road coloring theorem states that every primitive digraph has a synchronizing coloring. We study recent conjectures claiming that the...
متن کاملExtremal Energy of Digraphs with Two Linear Subdigraphs
The eigenvalues of a digraph are the eigenvalues of its adjacency matrix. The sum of the absolute values of the real part of the eigenvalues is called the energy of the digraph. The extremal energy of bicyclic digraphs with vertex-disjoint directed cycles is known. In this paper, we consider a class of bicyclic digraphs with exactly two linear subdigraphs of equal length. We find the minimal an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009